Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
881	Polylogarithmic-round Interactive Proofs for coNP Collapse the Exponential Hierarchy Alan L. Selman ∗ Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2004-02-23 11:23:03 Complexity classes Probabilistic complexity theory Structural complexity theory Arthur–Merlin protocol Karp–Lipton theorem Quantum complexity theory NP Interactive proof system IP Theoretical computer science Computational complexity theory Applied mathematics
882	Teaching Statement Scott Aaronson January 6, 2007 My basic proposal is to sing the ideas of theoretical computer science from the rooftops—by creating new undergraduate courses, training graduate students, helping tale Add to Reading List Source URL: scottaaronson.com Language: English - Date: 2007-01-07 23:25:27 Mathematical optimization Complexity classes NP-complete Computational complexity theory Algorithm P versus NP problem Quantum mechanics Quantum computer Sanjeev Arora Theoretical computer science Applied mathematics Mathematics
883	The Informational Content of Canonical Disjoint NP-Pairs Christian Glaßer ∗ Alan L. Selman† Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2007-08-15 14:41:53 Complexity classes NP PP Oracle machine Polynomial P P versus NP problem Matroid Theoretical computer science Computational complexity theory Applied mathematics
884	Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems Christian Glaßer ∗ Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2005-07-07 15:16:38 Complexity classes Computability theory Structural complexity theory Mathematical optimization NP-complete NP P versus NP problem Oracle machine Function Theoretical computer science Computational complexity theory Applied mathematics
885	Complete Distributional Problems, Hard Languages, and Resource-Bounded Measure A. Pavan† Alan L. Selman‡ Department of Computer Science University at Buffalo Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 1997-10-21 12:14:50 Complexity classes NP-complete P Time complexity Reduction Many-one reduction P versus NP problem NP-hard Theoretical computer science Computational complexity theory Applied mathematics
886	Much Ado about Functions Alan L. Selman Department of Computer Science State University of New York at Buffalo Buffalo, NY[removed]Abstract Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 1997-10-21 08:38:33 Structural complexity theory Complexity classes Functions and mappings Computability theory NP Multivalued function Oracle machine Time hierarchy theorem Inverse function Theoretical computer science Mathematics Computational complexity theory
887	Non-Mitotic Sets Christian Glasser∗, Alan L. Selman†, Stephen Travers‡, and Liyu Zhang§ 22nd June[removed]Abstract Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2006-06-22 10:53:44 Complexity classes Computability theory Structural complexity theory Mathematical optimization Many-one reduction NP-complete NP PP Reduction Theoretical computer science Computational complexity theory Applied mathematics
888	A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP Ashish V. Naik Alan L. Selman† Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 1997-10-21 12:46:24 Complexity classes Structural complexity theory Mathematical optimization Conjectures P versus NP problem NP P Time complexity Reduction Theoretical computer science Computational complexity theory Applied mathematics
889	The Complexity of Unions of Disjoint Sets Christian Glaßer∗, Alan L. Selman†, Stephen Travers‡, and Klaus W. Wagner∗ Abstract This paper is motivated by the open question whether the union of two disjoint NPcomp Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2006-11-08 15:58:52 Complexity classes Computability theory NP-complete problems Structural complexity theory Polynomial hierarchy NP PP Many-one reduction Oracle machine Theoretical computer science Computational complexity theory Applied mathematics
890	Communicating ASP and the Polynomial Hierarchy Kim Bauters1, , Steven Schockaert1, , Dirk Vermeir2 , and Martine De Cock1 1 Department of Applied Mathematics and Computer Science Add to Reading List Source URL: www.cwi.ugent.be Language: English - Date: 2011-07-25 12:41:03 Logic programming Complexity classes Structural complexity theory Boolean algebra Stable model semantics True quantified Boolean formula Answer set programming FO Polynomial hierarchy Theoretical computer science Computational complexity theory Applied mathematics

UPDATE